A Lower Bound for the Time to Assure Interactive Consistency

fConttnua on ravaraa alda It nacaaaary and Idantity by block numbar)The problem of "assuring interactive consistency" is defined in [PSL].20 It is assumed that there are n isolated processors, of which at most m arefaulty. The processors can communicate by means of two-party messages, usinga medium which is reliable and of negligible delay. The sender of a messageis always identifiable by the receiver. Each processor p has a private valueo(p). The problem is to devise an algorithm that will allow each proce-sor pto compute a value for each processor .r, such that (a) if p and r are nonfaulty •»•* I JAN 71 1473 EDITION OF I NOV •• IS OBSOLETES/'N 0103-014-6601 IunclassifiedSECURITY CLASSIFICATION OF THIS PAGE (Whan Data tntarad)